A decision method for Parikh slenderness of context-free languages

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decision Method for Parikh Slenderness of Context-free Languages

In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given context-free language is Parikh slender.

متن کامل

On Parikh slender context-free languages

In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science

متن کامل

Inductive Inference of Context-free Languages - Context-free Expression Method

An inductive inference problem of context-free languages is investigated. There have been many attempts to this problem, and most of them are based on a problem setting in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper , on the contrary, employs a kind of extensions of regular expressions called context-free expression...

متن کامل

The Parikh functions of sparse context-free languages are quasi-polynomials

Let L be a sparse context-free language over a finite alphabet A = {a1, . . . , at} and let fL : N t → N be its Parikh (counting) function. We prove that the map fL is a box spline, that is there exists a finite set Π of hyperplanes of R, through the origin, such that fL is a quasi-polynomial on every polyhedral cone determined by Π. Moreover we prove that the Parikh function of such a language...

متن کامل

Decision problem of substrings in Context Free Languages

A context free grammar (CFG) is a set of symbols and productions used to define a context free language. We present an algorithm which, given a CFG and a string α, decides whether a string of the form βαγ belongs to the language or not. There is a wide variety of applications where deciding if a string belongs to the defined language has relevance but, due to “visualization” limitations, it is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1997

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(96)00023-6